Formal and Finite Order Equivalences
نویسندگان
چکیده
We show that two families of germs of real-analytic subsets in Cn are formally equivalent if and only if they are equivalent of any finite order. We further apply the same technique to obtain analogous statements for equivalences of real-analytic self-maps and vector fields under conjugations. On the other hand, we provide an example of two sets of germs of smooth curves that are equivalent of any finite order but not formally equivalent.
منابع مشابه
Equivalences in Bicategories
In this paper, we establish some connections between the concept of an equivalence of categories and that of an equivalence in a bicategory. Its main result builds upon the observation that two closely related concepts, which could both play the role of an equivalence in a bicategory, turn out not to coincide. Two counterexamples are provided for that goal, and detailed proofs are given. In par...
متن کاملModel-checking process equivalences
Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal process equivalences, ranging from bisimulation to trace equivalence, categorised in the linear-time branching-time spectrum. We present a logical ...
متن کاملA logical characterization of data languages
The ideal case of formal languages. In the formal languages framework, the class of regular languages can be characterized in various ways: finite automata, rational expressions, monadic second-order logic, extended temporal logics, finite monoids... (see e.g. [RS97]). Among all these equivalences, the logical characterization is of particular interest since many subclasses of regular languages...
متن کاملA Formal Testing Framework for UML Statechart Diagrams Behaviours: From Theory to Automatic Verification
In this paper we propose a formal testing framework for a behavioural subset of UML Statechart Diagrams (UMLSDs). A new formal operational semantics is defined, which uses the same core semantics introduced in previous work of ours but which is better suited for testing theory. The new semantics is proved consistent with our original one and is guaranteed to generate only finite state machines....
متن کاملDeciding Hedged Bisimilarity
The spi-calculus is a formal model for the design and analysis of cryptographic protocols: many security properties, such as authentication and strong confidentiality, can be reduced to the verification of behavioural equivalences between spi processes. In this paper we provide an algorithm for deciding hedged bisimilarity on finite processes, which is equivalent to barbed equivalence (and coar...
متن کامل